A Survey of Categorical Computation: Fixed Points, . . .
نویسنده
چکیده
E. Moggi, Categories of Partial Morphism and the p -calculus, In Category Theory and Computer Programming, Lecture Notes in Computer Science 240, SpringerVerlag, 1986. [Mog88a] E. Moggi, Computational Lambda-Calculus and Monads, Technical Report ECSLFCS-88-66, University of Edinburgh, October, 1988. [Mog88b] E. Moggi, Partial Morphisms in Categories of E ective Objects, Information and Computation 76, 1988.
منابع مشابه
The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
The aim of this paper is to provide mathematical foundations of a graph transformation language, called UnCAL, using categorical semantics of type theory and fixed points. About twenty years ago, Buneman et al. developed a graph database query language UnQL on the top of a functional meta-language UnCAL for describing and manipulating graphs. Recently, the functional programming community has s...
متن کاملCategorical Buechi and Parity Conditions via Alternating Fixed Points of Functors
Categorical studies of recursive data structures and their associated reasoning principles have mostly focused on two extremes: initial algebras and induction, and final coalgebras and coinduction. In this paper we study their in-betweens. We formalize notions of alternating fixed points of functors using constructions that are similar to that of free monads. We find their use in categorical mo...
متن کاملGirard's $!()$ as a reversible fixed-point operator
We give a categorical description of the treatment of the !() exponential in the Geometry of Interaction system, with particular emphasis on the fact that the GoI interpretation 'forgets types'. We demonstrate that it may be thought of as a fixed-point operation for reversible logic & computation.
متن کاملTIME-VARYING FUZZY SETS BASED ON A GAUSSIAN MEMBERSHIP FUNCTIONS FOR DEVELOPING FUZZY CONTROLLER
The paper presents a novel type of fuzzy sets, called time-Varying Fuzzy Sets (VFS). These fuzzy sets are based on the Gaussian membership functions, they are depended on the error and they are characterized by the displacement of the kernels to both right and left side of the universe of discourse, the two extremes kernels of the universe are fixed for all time. In this work we focus only on t...
متن کاملStrongly Normalising Cyclic Data Computation by Iteration Categories of Second-Order Algebraic Theories
Cyclic data structures, such as cyclic lists, in functional programming are tricky to handle because of their cyclicity. This paper presents an investigation of categorical, algebraic, and computational foundations of cyclic datatypes. Our framework of cyclic datatypes is based on second-order algebraic theories of Fiore et al., which give a uniform setting for syntax, types, and computation ru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990